Dynamic regular registers in systems with churn
نویسندگان
چکیده
منابع مشابه
Regular Registers in Dynamic Distributed Systems with Byzantine Processes: Bounds and Performance Analysis
This paper addresses the problem of building a byzantine fault tolerant storage service implemented by a set of servers that can dynamically join and leave the computation (i.e., server churn). In this challenging environment, we prove a bound for ensuring both validity of read operations (i.e., readvalidity property) and the persistence of a value written by a write operation (i.e., write-pers...
متن کاملAn Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn
Distributed storage service is one of the main abstractions provided to the developers of distributed applications due to its capability to hide the complexity generated by the messages exchanged between processes. Many protocols have been proposed to build byzantine-faulttolerant storage services on top of a message-passing system, but they do not consider the possibility to have servers joini...
متن کاملBuilding Regular Registers with Rational Malicious Servers and Anonymous Clients
The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking read() and write() operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as rational malicious Byzantine process). We first model our problem as a Bayesian game between a...
متن کاملFault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The construction is in two steps: one implements a regular register using 1-regular registers, and the other implements a 1-regular register using saferegisters. In both steps, if the initial register is bounded then the implementati...
متن کاملWait-Free Stabilizing Dining Using Regular Registers
Dining philosophers is a scheduling paradigm that determines when processes in a distributed system should execute certain sections of their code so that processes do not execute ‘conflicting’ code sections concurrently, for some application-dependent notion of a ‘conflict’. Designing a stabilizing dining algorithm for shared-memory systems subject to process crashes presents an interesting cha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.019